|
In graph theory, complete coloring is the opposite of harmonious coloring in the sense that it is a vertex coloring in which every pair of colors appears on at least one pair of adjacent vertices. Equivalently, a complete coloring is minimal in the sense that it cannot be transformed into a proper coloring with fewer colors by merging pairs of color classes. The achromatic number ψ(G) of a graph G is the maximum number of colors possible in any complete coloring of G. ==Complexity theory== Finding ψ(G) is an optimization problem. The decision problem for complete coloring can be phrased as: :INSTANCE: a graph and positive integer :QUESTION: does there exist a partition of into or more disjoint sets such that each is an independent set for and such that for each pair of distinct sets is not an independent set. Determining the achromatic number is NP-hard; determining if it is greater than a given number is NP-complete, as shown by Yannakakis and Gavril in 1978 by transformation from the minimum maximal matching problem.〔 A1.1: GT5, pg.191.〕 Note that any coloring of a graph with the minimum number of colors must be a complete coloring, so minimizing the number of colors in a complete coloring is just a restatement of the standard graph coloring problem. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Complete coloring」の詳細全文を読む スポンサード リンク
|